//	ID : pallab81
// 	PROG : 10842
// 	LANG : C++
// 	2011-09-12-15.52.53 Monday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}
//UNION FIND STARTED
const int inf = (int)1e6;
int root[inf+10];
int rank[inf+10];
inline void _Set(){
    foE(i,0,inf){
       root[i]=i;
       rank[i]=0;
    }
}
inline int _Find(int x){
    if( x!= root[x] ){
        root[x] = _Find( root[x] );
    }
return root[x];
}
inline void _Union(int x, int y){
    int px = _Find(x);
    int py = _Find(y);
    if( rank[px] > rank[py] ){
        root[py] = px;
    }
    else{
        root[px]=py;
    }
    if( rank[px]==rank[py] ){
        rank[py]+=1;
    }
}

//UNION FIND ENDS
struct NODE{
    int x,y;
    int cc;
    NODE(int a, int b, int c):
    x(a),y(b),cc(c){;}
};
int k;
int n,m;
vector< NODE > edges;
inline bool cmp(NODE A, NODE B){
    return A.cc > B.cc;
}
inline void Read(){
    CI(n);
    CI(m);
    int x,y,cc;
    edges.clear();
    fo(i,0,m){
        CI(x);
        CI(y);
        CI(cc);
        edges.pb( NODE(x,y,cc) );
    }
}
inline void Proc(){
    _Set();
    sort(edges.begin(),edges.end(), cmp);

    int max_cap=0;
    bool flag=true;
    for(int i=0,j=0; i<m && j<=n-1; ++i ){
        int x = edges[i].x;
        int y = edges[i].y;
        int cc = edges[i].cc;
        if( _Find(x)!= _Find(y) ){
            _Union(x,y);
            ++j;
            if( flag ){
                max_cap = cc;
            }
            else{
                max_cap = min(max_cap, cc);
            }
        }
    }
    printf("Case #%d: %d\n",k,max_cap);
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in.txt","rt",stdin);
    #endif

    int cases=1;
    k=1;
    for( CI(cases) ; cases ; --cases ){
        Read();
        Proc();
        ++k;
    }

return 0;
}
